A joint replenishment problem considering multiple trucks with shipment and resource constraints

A joint replenishment problem (JRP) is presented to determine the optimal reordering policy for multi-items with a percentage of defective items. This JRP also has several constraints, such as shipment constraint, budget constraint, and transportation capacity constraint. At the meantime, multiple trucks, each with a fixed transportation cost, are considered and also order quantities of restricted items are not shared among the trucks during the shipment. The objective is to minimize the total expected cost per unit time. A two-dimensional genetic algorithm (GA) is provided to determine an optimal family cycle length and the reorder frequencies. A numerical example is presented and the results are discussed. Extensive computational experiments are performed to test the performance of the GA. The JRP is also solved by using an evolutionary algorithm (EA) and the results obtained from GA and EA are compared.     

基于GIS的最优路径选择的设计与实现

作为智能交通系统中的重要组成部分,最优路径选择直接决定着智能交通系统的用户体验。该文使用GIS数据模型,将道路抽象为由点和线组成的图,并根据图论理论构建出交通网络模型。在此基础上研究智能交通系统的最优路径选择的问题,同时考虑到交通系统中的实际问题,改进了Dijkstra算法,从而缩短最优路径搜索时间,提高系统效率。     

Two-dimensional discrete cosine transform on sliding windows

The discrete cosine transform (DCT) has been successfully used for a wide range of applications in digital signal processing. While there are efficient algorithms for implementing the DCT, its use becomes difficult in the sliding transform scenario where the transform window is shifted one sample at a time and the transform process is repeated. In this paper, a new two-dimensional sliding DCT (2-D SDCT) algorithm is proposed for fast implementation of the DCT on 2-D sliding windows. In the proposed algorithm, the DCT coefficients of the shifted window are computed by exploiting the recursive relationship between 2-D DCT outputs of three successive windows. The theoretical analysis shows that the computational requirement of the proposed 2-D SDCT algorithm is the lowest among existing 2-D DCT algorithms. Moreover, the proposed algorithm enables independent updating of each DCT coefficient.     

Mobile local search with noisy locations

The deep penetration of mobile devices have led to the emergence of multiple mobile applications that seek to harness the positioning capabilities embedded in such devices. One of the most functional of these applications is local search. Local search is similar to a regular web search, yet is more powerful in a mobile setting since results are ranked both by prominence and locality. Undoubtedly popular, the current design of local search applications fails to cater equally to a privacy-aware user who desires finer controls in her location disclosure. Towards this end, we propose the design for a private local search (PriLS) application that enables a user to first learn the geographic variation in local search results and then use it to determine a noisy location that has little or no affect on the search results. Parametric studies and real-world evaluations show that PriLS can help identify geographic locations that would produce similar search results (compared to when the user’s location is used) with no noticeable delays in user experience. They also reveal that large areas typically exist where there is no change in the result of a local search query, and can be exploited to provide spatial privacy guarantees to a user.     

A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem

This paper investigates the prize-collecting vehicle routing problem (PCVRP), which has a strong background in practical industries. In the PCVRP, the capacities of all available vehicles are not sufficient to satisfy the demands of all customers. Consequently it is not a compulsory requirement that all customers should be visited. However, a prize can be collected once a customer is visited. In addition, it is required that the total demands of visited customers should reach a pre-specified value at least. The objective is to establish a schedule of vehicle routes so as to minimize the total transportation cost and at the same time maximize the prize collected by all vehicles. The total transportation cost consists of the total distance of vehicle routes and the sum of vehicles used in the schedule. To solve the PCVRP, a two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm is developed according to the two levels of decisions in the PCVRP, namely the selection of customers to visit and the visiting sequence of selected customers in each vehicle route. The proposed TLSAVNS algorithm is self-adaptive because the neighborhoods and their search sequence are determined automatically by the algorithm itself based on the analysis of its search history. In addition, a graph extension method is adopted to obtain the lower bound for PCVRP by transforming the proposed mixed integer programming model of PCVRP into an equivalent traveling salesman problem (TSP) model, and the obtained lower bound is used to evaluate the proposed TLSAVNS algorithm. Computational results on benchmark problems show that the proposed TLSAVNS algorithm is efficient for PCVRP.     

Open channel junction velocity prediction by using a hybrid self-neuron adjustable artificial neural network

Determining the appropriate hidden layers neuron number is one of the most important processes in modeling the Multi-Layer Perceptron Artificial Neural Network (MLP-ANN). Despite the significant effect of the MLP-ANN neurons number on predicting accuracy, there is no definite rule for its determination. In this study, a new self-neuron number adjustable, hybrid Genetic Algorithm-Artificial Neural Network (GA-ANN), is introduced and its application examined on the complex velocity field prediction of an open channel junction. The results of GA-ANN were compared with those got by the Genetic Programming (GP) method as two applications of the Genetic Algorithm (GA). The comparisons showed that the GA-ANN model can predict the open channel junction velocity with higher accuracy than the GP model, with Root Mean Squared Error (RMSE) of 0.086 and 0.156, respectively. Finally the equation, obtained by applying the GA-ANN model, predicting the velocity at the open channel junction is presented.     

两种针对小信号的脉压优化算法及实现

结合某雷达项目,针对项目LFM和Taylor编码两种小时宽带宽积(TB)信号脉冲压缩效果不理想的问题,通过对两种不同小TB信号的实际回波波形和特性进行了分析,针对性地使用了倒推法和循环迭代法,获得了优化的脉压系数。试验得出结论,较之传统的匹配滤波脉冲压缩系数,采用优化脉压系数的LFM和Taylor编码小TB信号脉冲压缩主副瓣比均能提高十几dB。     

GA based decomposition of large scale distributed model predictive control systems

A novel method is proposed to find the optimal decomposition structure of distributed model predictive control (DMPC) systems. The input clustering decomposition (ICD) is first developed to minimize the coupling effects of subsystems and average the computational balance of each subsystem. To select the inputs and outputs in each subsystem, the input–output pairing decomposition (IOPD) is done. Then the genetic algorithm is used to solve decomposition problems for ICD and IOPD. The proposed method can achieve efficient coordination. Its structure is more flexible than the traditional DMPC. Two examples are used to show the abilities of the proposed method.     

Fuzzy logic speed controller optimization approach for induction motor drive using backtracking search algorithm

This paper presents an adaptive fuzzy logic controller (FLC) design technique for controlling an induction motor speed drive using backtracking search algorithm (BSA). This technique avoids the exhaustive traditional trial-and-error procedure for obtaining membership functions (MFs). The generated adaptive MFs are implemented in speed controller design for input and output based on the evaluation results of the fitness function formulated by the BSA. In this paper, the mean absolute error (MAE) of the rotor speed response for three phase induction motor (TIM) is used as a fitness function. An optimal BSA-based FLC (BSAF) fitness function is also employed to tune and minimize the MAE to improve the performance of the TIM in terms of changes in speed and torque. Moreover, the measurement of the real TIM parameters via three practical tests is used for simulation the TIM. Results obtained from the BSAF are compared with those obtained through gravitational search algorithm (GSA) and particle swarm optimization (PSO) to validate the developed controller. Design procedure and accuracy of the develop FLC are illustrated and investigated via simulation tests for TIM in a MATLAB/Simulink environment. Results show that the BSAF controller is better than the GSA and PSO controllers in all tested cases in terms of damping capability, and transient response under different mechanical loads and speeds.     

Tuning the Model Predictive Control of a Crude Distillation Unit

Tuning the parameters of the Model Predictive Control (MPC) of an industrial Crude Distillation Unit (CDU) is considered here. A realistic scenario is depicted where the inputs of the CDU system have optimizing targets, which are provided by the Real Time Optimization layer of the control structure. It is considered the nominal case, in which both the CDU model and the MPC model are the same. The process outputs are controlled inside zones instead of at fixed set points. Then, the tuning procedure has to define the weights that penalize the output error with respect to the control zone, the weights that penalize the deviation of the inputs from their targets, as well as the weights that penalize the input moves. A tuning approach based on multi-objective optimization is proposed and applied to the MPC of the CDU system. The performance of the controller tuned with the proposed approach is compared through simulation with the results of an existing approach also based on multi-objective optimization. The simulation results are similar, but the proposed approach has a computational load significantly lower than the existing method. The tuning effort is also much lower than in the conventional practical approaches that are usually based on ad-hoc procedures.